Compilation Schemes: A Theoretical Tool for Assessing the Expressive Power of Planning Formalisms

نویسنده

  • Bernhard Nebel
چکیده

The recent approaches of extending the graphplan algorithm to handle more expressive planning formalisms raise the question of what the formal meaning of \expressive power" is. We formalize the intuition that expressive power is a measure of how concisely planning domains and plans can be expressed in a particular formalism by introducing the notion of \compilation schemes" between planning formalisms. Using this notion, we analyze the expressive power of a large family of propositional planning formalisms and show, e.g., that Gazen and Knoblock's approach to compiling conditional eeects away is optimal .

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Compilability and Expressive Power of Propositional Planning Formalisms

The recent approaches of extending the GRAPHPLAN algorithm to handle more expressive planning formalisms raise the question of what the formal meaning of “expressive power” is. We formalize the intuition that expressive power is a measure of how concisely planning domains and plans can be expressed in a particular formalism by introducing the notion of “compilation schemes” between planning for...

متن کامل

Expressive Equivalence of Planning Formalisms

A concept of expressive equivalence for planning formalisms based on polynomial transformations is de ned. It is argued that this de nition is reasonable and useful both from a theoretical and from a practical perspective; if two languages are equivalent, then theoretical results carry over and, more practically, we can model an application problem in one language and then easily use a planner ...

متن کامل

Expressiveness of ADL and Golog: Functions Make a Difference

The main focus in the area of action languages, such as GOLOG, was put on expressive power, while the development in the area of action planning was focused on efficient plan generation. An integration of GOLOG and planning languages would provide great advantages. A user could constrain a system’s behavior on a high level using GOLOG, while the actual low-level actions are planned by an effici...

متن کامل

Assessing the Expressivity of Planning Formalisms through the Comparison to Formal Languages

From a theoretical perspective, judging the expressivity of planning formalisms helps to understand the relationship of different representations and to infer theoretical properties. From a practical point of view, it is important to be able to choose the best formalism for a problem at hand, or to ponder the consequences of introducing new representation features. Most work on the expressivity...

متن کامل

ON THE EXPRESSIVE POWER OF PLANNING FORMALISMS ConditionalEffects and Boolean Preconditions in the STRIPS Formalism

The notion of “expressive power” is often used in the literature on planning. However, it is usually only used in an informal way. In this paper, we will formalize this notion using the “compilability framework” and analyze the expressive power of some variants of allowing for conditional effects and arbitrary Boolean formulae in preconditions. One interesting consequence of this analysis is th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999